17 research outputs found
Universally Optimal Deterministic Broadcasting in the HYBRID Distributed Model
In theoretical computer science, it is a common practice to show existential
lower bounds for problems, meaning there is a family of pathological inputs on
which no algorithm can do better. However, most inputs of interest can be
solved much more efficiently, giving rise to the notion of universally optimal
algorithms, which run as fast as possible on every input. Questions on the
existence of universally optimal algorithms were first raised by Garay, Kutten,
and Peleg in FOCS '93. This research direction reemerged recently through a
series of works, including the influential work of Haeupler, Wajc, and Zuzic in
STOC '21, which resolves some of these decades-old questions in the supported
CONGEST model.
We work in the HYBRID distributed model, which analyzes networks combining
both global and local communication. Much attention has recently been devoted
to solving distance related problems, such as All-Pairs Shortest Paths (APSP)
in HYBRID, culminating in a round algorithm for exact
APSP. However, by definition, every problem in HYBRID is solvable in
(diameter) rounds, showing that it is far from universally optimal.
We show the first universally optimal algorithms in HYBRID, by presenting a
fundamental tool that solves any broadcasting problem in a universally optimal
number of rounds, deterministically. Specifically, we consider the problem in a
graph where a set of messages distributed arbitrarily across ,
requires every node to learn all of . We show a universal lower bound and a
matching, deterministic upper bound, for any graph , any value , and any
distribution of across .
This broadcasting tool opens a new exciting direction of research into
showing universally optimal algorithms in HYBRID. As an example, we use it to
obtain algorithms for approximate and exact APSP in general and sparse graphs
Sparse Matrix Multiplication and Triangle Listing in the Congested Clique Model
We show how to multiply two n x n matrices S and T over semirings in the Congested Clique model, where n nodes communicate in a fully connected synchronous network using O(log{n})-bit messages, within O(nz(S)^{1/3} nz(T)^{1/3}/n + 1) rounds of communication, where nz(S) and nz(T) denote the number of non-zero elements in S and T, respectively. By leveraging the sparsity of the input matrices, our algorithm greatly reduces communication costs compared with general multiplication algorithms [Censor-Hillel et al., PODC 2015], and thus improves upon the state-of-the-art for matrices with o(n^2) non-zero elements. Moreover, our algorithm exhibits the additional strength of surpassing previous solutions also in the case where only one of the two matrices is such. Particularly, this allows to efficiently raise a sparse matrix to a power greater than 2. As applications, we show how to speed up the computation on non-dense graphs of 4-cycle counting and all-pairs-shortest-paths.
Our algorithmic contribution is a new deterministic method of restructuring the input matrices in a sparsity-aware manner, which assigns each node with element-wise multiplication tasks that are not necessarily consecutive but guarantee a balanced element distribution, providing for communication-efficient multiplication.
Moreover, this new deterministic method for restructuring matrices may be used to restructure the adjacency matrix of input graphs, enabling faster deterministic solutions for graph related problems. As an example, we present a new sparsity aware, deterministic algorithm which solves the triangle listing problem in O(m/n^{5/3} + 1) rounds, a complexity that was previously obtained by a randomized algorithm [Pandurangan et al., SPAA 2018], and that matches the known lower bound of Omega~(n^{1/3}) when m=n^2 of [Izumi and Le Gall, PODC 2017, Pandurangan et al., SPAA 2018]. Naturally, our triangle listing algorithm also implies triangle counting within the same complexity of O(m/n^{5/3} + 1) rounds, which is (possibly more than) a cubic improvement over the previously known deterministic O(m^2/n^3)-round algorithm [Dolev et al., DISC 2012]
Distance Computations in the Hybrid Network Model via Oracle Simulations
The Hybrid network model was introduced in [Augustine et al., SODA '20] for
laying down a theoretical foundation for networks which combine two possible
modes of communication: One mode allows high-bandwidth communication with
neighboring nodes, and the other allows low-bandwidth communication over few
long-range connections at a time. This fundamentally abstracts networks such as
hybrid data centers, and class-based software-defined networks.
Our technical contribution is a \emph{density-aware} approach that allows us
to simulate a set of \emph{oracles} for an overlay skeleton graph over a Hybrid
network.
As applications of our oracle simulations, with additional machinery that we
provide, we derive fast algorithms for fundamental distance-related tasks. One
of our core contributions is an algorithm in the Hybrid model for computing
\emph{exact} weighted shortest paths from sources which
completes in rounds w.h.p. This improves, in both the
runtime and the number of sources, upon the algorithm of [Kuhn and Schneider,
PODC '20], which computes shortest paths from a single source in rounds w.h.p.
We additionally show a 2-approximation for weighted diameter and a
-approximation for unweighted diameter, both in rounds w.h.p., which is comparable to the
lower bound of [Kuhn and Schneider, PODC '20] for a
-approximation for weighted diameter and an exact unweighted
diameter. We also provide fast distance \emph{approximations} from multiple
sources and fast approximations for eccentricities.Comment: To appear in STACS 202
Quantum Distributed Algorithms for Detection of Cliques
The possibilities offered by quantum computing have drawn attention in the distributed computing community recently, with several breakthrough results showing quantum distributed algorithms that run faster than the fastest known classical counterparts, and even separations between the two models. A prime example is the result by Izumi, Le Gall, and Magniez [STACS 2020], who showed that triangle detection by quantum distributed algorithms is easier than triangle listing, while an analogous result is not known in the classical case.
In this paper we present a framework for fast quantum distributed clique detection. This improves upon the state-of-the-art for the triangle case, and is also more general, applying to larger clique sizes.
Our main technical contribution is a new approach for detecting cliques by encapsulating this as a search task for nodes that can be added to smaller cliques. To extract the best complexities out of our approach, we develop a framework for nested distributed quantum searches, which employ checking procedures that are quantum themselves.
Moreover, we show a circuit-complexity barrier on proving a lower bound of the form ?(n^{3/5+?}) for K_p-detection for any p ? 4, even in the classical (non-quantum) distributed CONGEST setting
Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs
In this paper we give fast distributed graph algorithms for detecting and listing small subgraphs, and for computing or approximating the girth. Our algorithms improve upon the state of the art by polynomial factors, and for girth, we obtain a constant-time algorithm for additive +1 approximation in Congested Clique, and the first parametrized algorithm for exact computation in Congest.
In the Congested Clique model, we first develop a technique for learning small neighborhoods, and apply it to obtain an O(1)-round algorithm that computes the girth with only an additive +1 error. Next, we introduce a new technique (the partition tree technique) allowing for efficiently listing all copies of any subgraph, which is deterministic and improves upon the state-of the-art for non-dense graphs. We give two concrete applications of the partition tree technique: First we show that for constant k, it is possible to solve C_{2k}-detection in O(1) rounds in the Congested Clique, improving on prior work, which used fast matrix multiplication and thus had polynomial round complexity. Second, we show that in triangle-free graphs, the girth can be exactly computed in time polynomially faster than the best known bounds for general graphs. We remark that no analogous result is currently known for sequential algorithms.
In the Congest model, we describe a new approach for finding cycles, and instantiate it in two ways: first, we show a fast parametrized algorithm for girth with round complexity O?(min{g? n^{1-1/?(g)},n}) for any girth g; and second, we show how to find small even-length cycles C_{2k} for k = 3,4,5 in O(n^{1-1/k}) rounds. This is a polynomial improvement upon the previous running times; for example, our C?-detection algorithm runs in O(n^{2/3}) rounds, compared to O(n^{3/4}) in prior work. Finally, using our improved C?-freeness algorithm, and the barrier on proving lower bounds on triangle-freeness of Eden et al., we show that improving the current ??(?n) lower bound for C?-freeness of Korhonen et al. by any polynomial factor would imply strong circuit complexity lower bounds
Constant-Round Spanners and Shortest Paths in Congested Clique and MPC
In this work we present the first constant-round algorithms for computing spanners and approximate All-Pairs Shortest Paths (APSP) in the distributed CONGESTED CLIQUE model. Specifically, we show the following results for undirected n-node graphs. ulFor every integer k ≥ 1, O(1)-round algorithms for constructing O(k)-spanners with O(n1+1/k) edges in unweighted graphs, and O(k)-spanners with O(n1+1/k log n) edges in weighted graphs. An O(1)-round algorithm for O(log n)-approximation for APSP in unweighted graphs. An O(1)-round algorithm for O(log2n)-approximation for APSP in weighted graphs. All our algorithms are randomized and succeed with high probability. Prior to our work, the fastest algorithms for computing O(k)-spanners in this model require poly(log k) rounds [Parter, Yogev, DISC '18] [Biswas et al., SPAA '21], and the fastest algorithms for approximate shortest paths require poly(log log n) rounds [Dory, Parter, PODC '20]. Our results extend to the closely related massively parallel computation (MPC) model with near-linear memory per machine, leading to the first O(1)-round algorithms for spanners and approximate shortest paths in this model as well